A new family of Secant-like method with super-linear convergence

نویسندگان

  • Vinay Kanwar
  • Janak Raj Sharma
  • Mamta
چکیده

Another new family of Secant-like method is proposed in this paper. Analysis of convergence shows that the method has a super-linear convergence as Secant method. Numerical experiments show that the efficiency of the method is depended on the value of its parameter. AMS Subject Classification: 65D99, 65H05

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A family of improved secant-like method with super-linear convergence

A family of improved secant-like method is proposed in this paper. Further, the analysis of the convergence shows that this method has super-linear convergence. Efficiency are demonstrated by numerical experiments when the choice of α is correct. Keywords—Nonlinear equations, Secant method, Convergence order, Secant-like method.

متن کامل

A note on the convergence of the secant method for simple and multiple roots

The secant method is one of the most popular methods for root finding. Standard text books in numerical analysis state that the secant method is super linear: the rate of convergence is set by the gold number. Nevertheless, this property holds only for simple roots. If the multiplicity of the root is larger than one, the convergence of the secant method becomes linear. This communication includ...

متن کامل

A New Derivative-Free Quasi-Secant Algorithm For Solving Non-Linear Equations

Most of the nonlinear equation solvers do not converge always or they use the derivatives of the function to approximate the root of such equations. Here, we give a derivative-free algorithm that guarantees the convergence. The proposed two-step method, which is to some extent like the secant method, is accompanied with some numerical examples. The illustrative instances manifest that the rate ...

متن کامل

On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating

In previous work, the authors provided a foundation for the theory of variable metric proximal point algorithms in Hilbert space. In that work conditions are developed for global, linear, and super–linear convergence. This paper focuses attention on two matrix secant updating strategies for the finite dimensional case. These are the Broyden and BFGS updates. The BFGS update is considered for ap...

متن کامل

Super linear Projected Structured Exact Penalty Secant Methods for Constrained Nonlinear Least Squares

We present an exact penalty approach for solving constrained nonlinear least squares problems, using a new projected structured Hessian approximation scheme. We establish general conditions for the local two-step Q-superlinear convergence of our given algorithm. The approach is general enough to include the projected version of the structured PSB, DFP and BFGS formulas as special cases. The num...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 171  شماره 

صفحات  -

تاریخ انتشار 2005